Logical-to-physical mapping

ABSTRACT

A logical to physical (L2P) mapping component can determine whether an offset between a physical page address (PPA) and a logical block address (LBA) will be altered in response to writing data corresponding to the PPA and comprising at least one redundant array of independent NAND parity bit to a first level of a logical to physical (L2P) data structure or a second level of the L2P data structure, or both. The L2P mapping component can further cause an indication comprising at least two bits corresponding to the offset to be written to the first level of the L2P data structure or the second level of the L2P data structure, or both.

PRIORITY INFORMATION

This application is a Continuation of U.S. application Ser. No.16/996,329, filed Aug. 18, 2020, the contents of which are includedherein by reference.

TECHNICAL FIELD

Embodiments of the disclosure relate generally to memory sub-systems,and more specifically, relate to logical-to-physical mapping.

BACKGROUND

A memory sub-system can include one or more memory devices that storedata. The memory devices can be, for example, non-volatile memorydevices and volatile memory devices. In general, a host system canutilize a memory sub-system to store data at the memory devices and toretrieve data from the memory devices.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure will be understood more fully from the detaileddescription given below and from the accompanying drawings of variousembodiments of the disclosure.

FIG. 1 illustrates an example computing system that includes a memorysub-system in accordance with some embodiments of the presentdisclosure.

FIG. 2 illustrates an example logical-to-physical mapping component andmemory device in accordance with some embodiments of the presentdisclosure.

FIG. 3 illustrates an example logical-to-physical data structure inaccordance with some embodiments of the present disclosure.

FIG. 4 illustrates an example of a logical-to-physical address inaccordance with some embodiments of the present disclosure.

FIG. 5 is a flow diagram corresponding to a method forlogical-to-physical mapping in accordance with some embodiments of thepresent disclosure.

FIG. 6 is a block diagram of an example computer system in whichembodiments of the present disclosure may operate.

DETAILED DESCRIPTION

Aspects of the present disclosure are directed to logical-to-physical(L2P) mapping, in particular to memory sub-systems that include a L2Pmapping component. A memory sub-system can be a storage system, storagedevice, a memory module, or a combination of such. An example of amemory sub-system is a storage system such as a solid-state drive (SSD).Examples of storage devices and memory modules are described below inconjunction with FIG. 1 , et alibi. In general, a host system canutilize a memory sub-system that includes one or more components, suchas memory devices that store data. The host system can provide data tobe stored at the memory sub-system and can request data to be retrievedfrom the memory sub-system.

A memory device can be a non-volatile memory device. One example ofnon-volatile memory devices is a negative-and (NAND) memory device (alsoknown as flash technology). Other examples of non-volatile memorydevices are described below in conjunction with FIG. 1 . A non-volatilememory device is a package of one or more dice. Each die can consist ofone or more planes. Planes can be groups into logic units (LUN). Forsome types of non-volatile memory devices (e.g., NAND devices), eachplane consists of a set of physical blocks. Each block consists of a setof pages. Each page consists of a set of memory cells (“cells”). A cellis an electronic circuit that stores information. A block hereinafterrefers to a unit of the memory device used to store data and can includea group of memory cells, a word line group, a word line, or individualmemory cells. For some memory devices, blocks (also hereinafter referredto as “memory blocks”) are the smallest area than can be erased. Pagescannot be erased individually, and only whole blocks can be erased.

Each of the memory devices can include one or more arrays of memorycells. Depending on the cell type, a cell can store one or more bits ofbinary information, and has various logic states that correlate to thenumber of bits being stored. The logic states can be represented bybinary values, such as “0” and “1”, or combinations of such values.There are various types of cells, such as single level cells (SLCs),multi-level cells (MLCs), triple level cells (TLCs), and quad-levelcells (QLCs). For example, a SLC can store one bit of information andhas two logic states.

Some NAND memory devices employ a floating-gate architecture in whichmemory accesses are controlled based on a relative voltage changebetween the bit line and the word lines. Other examples of NAND memorydevices can employ a replacement-gate architecture that can include theuse of word line layouts that can allow for charges corresponding todata values to be trapped within memory cells based on properties of thematerials used to construct the word lines.

During operation, data can be written to a memory sub-system and storedfor subsequent retrieval. The data can be written consecutively suchthat the data is written to a consecutive series of memory blocks or,the data can be written non-consecutively such that the data is writtento memory blocks that do not form part of a consecutive series of memoryblocks. In order to keep track of the physical locations in the memorysub-system in which data is stored, physical page addresses (e.g.,addresses that correspond to a physical memory cell or memory block inwhich the data is stored) are recorded in a logical block address (LBA)in a logical-to-physical (L2P) data structure that is maintained withinthe memory sub-system.

In some approaches, the L2P data structure can be a P-level L2P table,where P is a non-zero integer. A simple example in accordance with someapproaches may include a 3-level L2P table. The first-level table maycontain addresses of the second-level tables, which may be referred toas “segments.” In turn, the second-level table can contain addressesassociated with the third-level tables. In some approaches, each segmentmay include an L2P table for a small range of LBAs (e.g., 1024 LBAs).

Such approaches can attempt to simplify mapping between the physicalpage addresses (PPAs) and the LBAs by recording certain indications incertain levels of the L2P tables based on whether the PPAs and/or LBAsare consecutive or non-consecutive. For example, some approaches canrecord the PPA of an LBA in a third-level L2P table if the PPA writtento the third-level L2P data structure is consecutive and record a singlebit indication (e.g., a “1”) in the second-level L2P table correspondingto the PPA written to the third-level L2P table being consecutive. Inaddition, some approaches can record the PPA of an LBA in a third-levelL2P table if the PPA written to the third-level L2P data structure isnon-consecutive and record a single bit indication (e.g., a “0”) in thesecond-level L2P table corresponding to the PPA written to thethird-level L2P table being non-consecutive. In accordance with suchapproaches, when a host write is sequential, the data (e.g., the PPAs)written to the third-level L2P table should be sequential as well.

However, as improved media management techniques, such as advanced readrecovery methodologies, are developed and implemented in memorysub-systems, such simplistic approaches can suffer from variousdeficiencies. For example, as parity-based data recovery techniques suchas redundant array of NAND (RAIN), among others, gain prevalence inmemory sub-systems, the approaches described above can become unwieldyand inefficient. As an example, if RAIN parity data is written to an L2Ptable in addition to the PPA, in the approaches described above, aconsecutive host write can yield a non-consecutive entry in the L2Ptable, which can lead to scenarios in which the L2P entry crosses fromone memory block to another. In such scenarios, keeping track of thedata can require additional resources in tracking non-consecutive L2Ptable entries across multiple blocks of the memory sub-system.

Aspects of the present disclosure address the above and otherdeficiencies by recording an offset between the LBA and the PPA using amulti-bit indication. As described in more detail herein, if the offsetis altered based on the opening of a new memory block (e.g., because anL2P entry will cross from one memory block to another), a particularindication can be written to a pair of bits in the second-level L2P datastructure in addition to a string of bits corresponding to the LBA ofthe first position in the new block. LBAs before the first position inthe new block can use one offset based on the stored indication whileLBAs after the first position in the new block can use a differentoffset based on the indication. This can further allow for thethird-level L2P data structure to be generated based on the offsetand/or a controller hardware auxiliary engine.

FIG. 1 illustrates an example computing system 100 that includes amemory sub-system 110 in accordance with some embodiments of the presentdisclosure. The memory sub-system 110 can include media, such as one ormore volatile memory devices (e.g., memory device 140), one or morenon-volatile memory devices (e.g., memory device 130), or a combinationof such.

A memory sub-system 110 can be a storage device, a memory module, or ahybrid of a storage device and memory module. Examples of a storagedevice include a solid-state drive (SSD), a flash drive, a universalserial bus (USB) flash drive, an embedded Multi-Media Controller (eMMC)drive, a Universal Flash Storage (UFS) drive, a secure digital (SD)card, and a hard disk drive (HDD). Examples of memory modules include adual in-line memory module (DIMM), a small outline DIMM (SO-DIMM), andvarious types of non-volatile dual in-line memory modules (NVDIMMs).

The computing system 100 can be a computing device such as a desktopcomputer, laptop computer, server, network server, mobile device, avehicle (e.g., airplane, drone, train, automobile, or other conveyance),Internet of Things (IoT) enabled device, embedded computer (e.g., oneincluded in a vehicle, industrial equipment, or a networked commercialdevice), or such computing device that includes memory and a processingdevice.

The computing system 100 can include a host system 120 that is coupledto one or more memory sub-systems 110. In some embodiments, the hostsystem 120 is coupled to different types of memory sub-system 110. FIG.1 illustrates one example of a host system 120 coupled to one memorysub-system 110. As used herein, “coupled to” or “coupled with” generallyrefers to a connection between components, which can be an indirectcommunicative connection or direct communicative connection (e.g.,without intervening components), whether wired or wireless, includingconnections such as electrical, optical, magnetic, and the like.

The host system 120 can include a processor chipset and a software stackexecuted by the processor chipset. The processor chipset can include oneor more cores, one or more caches, a memory controller (e.g., an SSDcontroller), and a storage protocol controller (e.g., PCIe controller,SATA controller). The host system 120 uses the memory sub-system 110,for example, to write data to the memory sub-system 110 and read datafrom the memory sub-system 110.

The host system 120 can be coupled to the memory sub-system 110 via aphysical host interface. Examples of a physical host interface include,but are not limited to, a serial advanced technology attachment (SATA)interface, a peripheral component interconnect express (PCIe) interface,universal serial bus (USB) interface, Fibre Channel, Serial AttachedSCSI (SAS), Small Computer System Interface (SCSI), a double data rate(DDR) memory bus, a dual in-line memory module (DIMM) interface (e.g.,DIMM socket interface that supports Double Data Rate (DDR)), Open NANDFlash Interface (ONFI), Double Data Rate (DDR), Low Power Double DataRate (LPDDR), or any other interface. The physical host interface can beused to transmit data between the host system 120 and the memorysub-system 110. The host system 120 can further utilize an NVM Express(NVMe) interface to access components (e.g., memory devices 130) whenthe memory sub-system 110 is coupled with the host system 120 by thePCIe interface. The physical host interface can provide an interface forpassing control, address, data, and other signals between the memorysub-system 110 and the host system 120. FIG. 1 illustrates a memorysub-system 110 as an example. In general, the host system 120 can accessmultiple memory sub-systems via a same communication connection,multiple separate communication connections, and/or a combination ofcommunication connections.

The memory devices 130, 140 can include any combination of the differenttypes of non-volatile memory devices and/or volatile memory devices. Thevolatile memory devices (e.g., memory device 140) can be, but are notlimited to, random access memory (RAM), such as dynamic random-accessmemory (DRAM) and synchronous dynamic random access memory (SDRAM).

Some examples of non-volatile memory devices (e.g., memory device 130)include negative-and (NAND) type flash memory and write-in-place memory,such as three-dimensional cross-point (“3D cross-point”) memory device,which is a cross-point array of non-volatile memory cells. A cross-pointarray of non-volatile memory can perform bit storage based on a changeof bulk resistance, in conjunction with a stackable cross-gridded dataaccess array. Additionally, in contrast to many flash-based memories,cross-point non-volatile memory can perform a write in-place operation,where a non-volatile memory cell can be programmed without thenon-volatile memory cell being previously erased. NAND type flash memoryincludes, for example, two-dimensional NAND (2D NAND) andthree-dimensional NAND (3D NAND).

Each of the memory devices 130, 140 can include one or more arrays ofmemory cells. One type of memory cell, for example, single level cells(SLC) can store one bit per cell. Other types of memory cells, such asmulti-level cells (MLCs), triple level cells (TLCs), quad-level cells(QLCs), and penta-level cells (PLC) can store multiple bits per cell. Insome embodiments, each of the memory devices 130 can include one or morearrays of memory cells such as SLCs, MLCs, TLCs, QLCs, or anycombination of such. In some embodiments, a particular memory device caninclude an SLC portion, and an MLC portion, a TLC portion, a QLCportion, or a PLC portion of memory cells. The memory cells of thememory devices 130 can be grouped as pages that can refer to a logicalunit of the memory device used to store data. With some types of memory(e.g., NAND), pages can be grouped to form blocks.

Although non-volatile memory components such as three-dimensionalcross-point arrays of non-volatile memory cells and NAND type memory(e.g., 2D NAND, 3D NAND) are described, the memory device 130 can bebased on any other type of non-volatile memory or storage device, suchas such as, read-only memory (ROM), phase change memory (PCM),self-selecting memory, other chalcogenide based memories, ferroelectrictransistor random-access memory (FeTRAM), ferroelectric random accessmemory (FeRAM), magneto random access memory (MRAM), Spin TransferTorque (STT)-MRAM, conductive bridging RAM (CBRAM), resistive randomaccess memory (RRAM), oxide based RRAM (OxRAM), negative-or (NOR) flashmemory, and electrically erasable programmable read-only memory(EEPROM).

The memory sub-system controller 115 (or controller 115 for simplicity)can communicate with the memory devices 130 to perform operations suchas reading data, writing data, or erasing data at the memory devices 130and other such operations. The memory sub-system controller 115 caninclude hardware such as one or more integrated circuits and/or discretecomponents, a buffer memory, or a combination thereof. The hardware caninclude digital circuitry with dedicated (i.e., hard-coded) logic toperform the operations described herein. The memory sub-systemcontroller 115 can be a microcontroller, special purpose logic circuitry(e.g., a field programmable gate array (FPGA), an application specificintegrated circuit (ASIC), etc.), or other suitable processor.

The memory sub-system controller 115 can include a processor 117 (e.g.,a processing device) configured to execute instructions stored in alocal memory 119. In the illustrated example, the local memory 119 ofthe memory sub-system controller 115 includes an embedded memoryconfigured to store instructions for performing various processes,operations, logic flows, and routines that control operation of thememory sub-system 110, including handling communications between thememory sub-system 110 and the host system 120.

In some embodiments, the local memory 119 can include memory registersstoring memory pointers, fetched data, etc. The local memory 119 canalso include read-only memory (ROM) for storing micro-code. While theexample memory sub-system 110 in FIG. 1 has been illustrated asincluding the memory sub-system controller 115, in another embodiment ofthe present disclosure, a memory sub-system 110 does not include amemory sub-system controller 115, and can instead rely upon externalcontrol (e.g., provided by an external host, or by a processor orcontroller separate from the memory sub-system).

In general, the memory sub-system controller 115 can receive commands oroperations from the host system 120 and can convert the commands oroperations into instructions or appropriate commands to achieve thedesired access to the memory device 130 and/or the memory device 140.The memory sub-system controller 115 can be responsible for otheroperations such as wear leveling operations, garbage collectionoperations, error detection and error-correcting code (ECC) operations,encryption operations, caching operations, and address translationsbetween a logical address (e.g., logical block address (LBA), namespace)and a physical address (e.g., physical block address, physical medialocations, etc.) that are associated with the memory devices 130. Thememory sub-system controller 115 can further include host interfacecircuitry to communicate with the host system 120 via the physical hostinterface. The host interface circuitry can convert the commandsreceived from the host system into command instructions to access thememory device 130 and/or the memory device 140 as well as convertresponses associated with the memory device 130 and/or the memory device140 into information for the host system 120.

The memory sub-system 110 can also include additional circuitry orcomponents that are not illustrated. In some embodiments, the memorysub-system 110 can include a cache or buffer (e.g., DRAM) and addresscircuitry (e.g., a row decoder and a column decoder) that can receive anaddress from the memory sub-system controller 115 and decode the addressto access the memory device 130 and/or the memory device 140.

In some embodiments, the memory device 130 includes local mediacontrollers 135 that operate in conjunction with memory sub-systemcontroller 115 to execute operations on one or more memory cells of thememory devices 130. An external controller (e.g., memory sub-systemcontroller 115) can externally manage the memory device 130 (e.g.,perform media management operations on the memory device 130). In someembodiments, a memory device 130 is a managed memory device, which is araw memory device combined with a local controller (e.g., localcontroller 135) for media management within the same memory devicepackage. An example of a managed memory device is a managed NAND (MNAND)device.

The memory sub-system 110 can include a logical-to-physical (L2P)mapping component 113. Although not shown in FIG. 1 so as to notobfuscate the drawings, the L2P mapping component 113 can includevarious circuitry to facilitate mapping of logical-to-physical addresseswithin the memory sub-system 110. In some embodiments, the L2P mappingcomponent 113 can include special purpose circuitry in the form of anASIC, FPGA, state machine, and/or other logic circuitry that can allowthe L2P mapping component 113 to orchestrate and/or perform operationsto perform L2P mapping operations for the memory device 130 and/or thememory device 140.

In some embodiments, the memory sub-system controller 115 includes atleast a portion of the L2P mapping component 113. For example, thememory sub-system controller 115 can include a processor 117 (processingdevice) configured to execute instructions stored in local memory 119for performing the operations described herein. In some embodiments, theL2P mapping component 113 is part of the host system 110, anapplication, or an operating system.

In a non-limiting example, an apparatus (e.g., the memory sub-system110) can include a L2P mapping component 113. The L2P mapping component113 can be resident on the memory sub-system 110. As used herein, theterm “resident on” refers to something that is physically located on aparticular component. For example, the L2P mapping component 113 being“resident on” the memory sub-system 110 refers to a condition in whichthe hardware circuitry that comprises the L2P mapping component 113 isphysically located on the memory sub-system 110. The term “resident on”may be used interchangeably with other terms such as “deployed on” or“located on,” herein.

The L2P mapping component 113 can determine whether an offset between aphysical page address (PPA) and a logical block address (LBA) will bealtered in response to writing data corresponding to the PPA to a firstlevel of a logical to physical (L2P) data structure (e.g., one of theL2P data structures 232-1 to 232-3 illustrated in FIG. 2 ) and/or asecond level of the L2P data structure (e.g., one of the L2P datastructures 232-1 to 232-3 illustrated in FIG. 2 ). The L2P mappingcomponent 113 can cause an indication comprising at least two bits andcorresponding to the offset to be written to one level of the L2P datastructure and/or another level of the L2P data structure. In someembodiments, the data corresponding to the PPA can include at least oneredundant array of independent NAND parity bit.

The indication can correspond to a determination that a first portion ofthe data is consecutive with respective to a preceding L2P addresswritten to one level of the L2P data structure (e.g., the second-levelL2P data structure 232-2) or another level of the L2P data structure(e.g., the third-level L2P data structure 232-3), and a second portionof the data is consecutive with respect to a subsequent L2P addresswritten to one level of the L2P data structure or another level of theL2P data structure, as described in more detail in connection with FIG.3 , herein. Embodiments are not so limited, however, and in someembodiments, the indication can correspond to a determination that onelevel of the L2P data structure and another level of the L2P datastructure contain consecutively written data or a determination that onelevel of the L2P data structure or another level of the L2P datastructure, or both, contain non-consecutively written data. Further, insome embodiments, the indication can correspond to a determination thata first portion of the data corresponding to the PPA is written to onelevel of the L2P data structure and the second portion of the datacorresponding to the PPA is written to another level of the L2P datastructure.

Continuing with this example, the offset can be altered in response to amemory block (e.g., the memory block 334-2 illustrated in FIG. 3 ,herein) being opened to accommodate at least a portion of the datacorresponding to the PPA. For example, as described in more detail inconnection with FIG. 3 , herein, the data corresponding to the PPA(e.g., the L2P address 336-2 illustrated in FIG. 3 , herein) canstraddle two memory blocks (e.g., the memory blocks 334-1 and 334-2illustrated in FIG. 3 , herein) thereby necessitating opening a newblock (e.g., the memory block 334-2 illustrated in FIG. 3 , herein) toaccommodate the data corresponding to the PPA. As described inconnection with FIG. 3 , this can cause a portion of the datacorresponding to the PPA to be consecutive with respect to a precedingset of data corresponding to a different PPA (e.g., the L2P address336-1 illustrated in FIG. 3 , herein) and a different portion of thedata corresponding to the PPA to be consecutive with respect to datacorresponding to yet another PPA (e.g., the L2P address 336-3illustrated in FIG. 3 , herein) that is written subsequently.

Finally, in this non-limiting example, a first portion of the datacorresponding to the PPA can be written to the first level of the L2Pdata structure and a second portion of the data corresponding to the PPAcan be written to the second level of the L2P data structure. In thiscase, the offset can be altered based, at least in part, on the firstportion of the data being written to one level of the L2P data structureand the second portion of the data being written to another level of theL2P data structure.

FIG. 2 illustrates an example logical-to-physical (L2P) mappingcomponent 213 and memory device 230 in accordance with some embodimentsof the present disclosure. The L2P mapping component 213 can beanalogous to the L2P mapping component 113 illustrated in FIG. 1 , whilethe memory device 230 can be analogous to the memory device 130illustrated in FIG. 1 , herein.

As shown in FIG. 2 , the memory device 230 can include multiple L2P datastructures 232-1, 232-2, and 232-3. For example, the memory device 230can include a first-level L2P data structure 232-1, a second-level L2Pdata structure 232-2, and a third-level L2P data structure 232-3.Embodiments are no limited to scenarios in which the memory device 230includes three discrete L2P data structures, however, and the memorydevice 230 can include any number of L2P data structures. As describedabove, the first-level L2P data structure 232-1 can contain addresses ofthe second-level L2P dada structure 232-2, and the second-level L2P datastructure 232-2 can contain addresses associated with the third-levelL2P data structure 232-3.

Data corresponding to PPAs (e.g., L2P addresses, such as the L2Paddresses 336-1, 336-2, and/or 336-3 illustrated in FIG. 3 , herein) canbe written to the first-level L2P data structure 232-1, the second-levelL2P data structure 232-2, and/or the third-level L2P data structure232-3 in accordance with embodiments described herein. For example, L2Paddresses can be written to the first-level L2P data structure 232-1,the second-level L2P data structure 232-2, and/or the third-level L2Pdata structure 232-3 as described in connection with Table 1, below.

FIG. 3 illustrates an example logical-to-physical (L2P) data structure332 in accordance with some embodiments of the present disclosure. TheL2P data structure 332 can be analogous to the L2P data structures232-1, 232-2, and/or 232-3 illustrated in FIG. 2 . As shown in FIG. 3 ,the L2P data structure 332 can include multiple blocks of memory 334-1to 334-N to which data corresponding to PPAs, such as L2P addresses336-1, 336-2, and/or 336-3 can be written.

In the example shown in FIG. 3 , the L2P addresses 336-1 and 336-3contain consecutive data entries such that they are each include withina single memory block 334-1 to 334-N. For example, the L2P address 336-1is contained in the memory block 334-1 and the L2P address 336-3 iscontained within the memory block 334-2. However, the L2P address 336-2has a first portion that is written to the first memory block 334-1 anda second portion that is written to the second memory block 334-2 suchthat the L2P address 336-2 straddles the two memory blocks 334-1 and334-2. Stated alternatively, the L2P address 336-2 can benon-consecutive and/or can be offset from a starting address location ofthe first memory block 334-1 and a starting address of the second memoryblock 334-2, as described in more detail in connection with Table 1.

Table 1 illustrates an example logical-to-physical mapping when datacorresponding to a PPA and/or a L2P address (e.g., the L2P address336-2) straddles two memory blocks 334-1 and 334-2. In the exampleillustrated in Table 1, one portion of the L2P address 336-2 is in aprevious open memory block 334-1 while another portion of the L2Paddress 336-2 is located in a next open memory block 334-2. Assumingthen that the PPA-LBA=X and the next offset is Y, the L2P addresses336-1, 336-2, and/or 336-3 can be determined as shown in Table 1.

TABLE 1 PREVIOUS L2P CURRENT L2P NEXT L2P X + LBA X + LBA Y + LBA X +LBA . . . Y + LBA X + LBA X + LBA Y + LBA X + LBA Y + LBA (or LBA Z) Y +LBA . . . . . . . . . X + LBA Y + LBA Y + LBA

As shown in Table 1, a preceding second-level L2P address (e.g., a L2Paddress written to the second-level L2P data structure 232-2 illustratedin FIG. 2 , herein) can be X, a current L2P address can be (0x8000|Z)and the next L2P address can be Y. From this it follows that thesecond-level L2P address for a non-consecutive third-level L2P address(e.g., a L2P address written to the third-level L2P data structure 232-3illustrated in FIG. 2 , herein) can be (0x4000|The PPA of thethird-level L2P address).

In a non-limiting example, a memory sub-system (e.g., the memorysub-system 110 illustrated in FIG. 1 , herein) can include a memorydevice (e.g., the memory device 130 illustrated in FIG. 1 , herein) thatcan store a logical to physical (L2P) data structure 332 that includes afirst memory block 334-1 and a second memory block 334-2. A processingdevice (e.g., the L2P mapping component 213 illustrated in FIG. 2 ,herein) can be coupled to the memory device and perform variousoperations. For example, the processing device can perform operationsthat include determining that a first portion of a logical-to-physical(L2P) address 336-2 is to be written to the first memory block 334-1 anda second portion of the L2P address 336-2 is to be written to the secondmemory block 334-2. As described elsewhere herein, the L2P address 336-2can include at least one parity bit.

The processing device can further perform operations includingdetermining whether an offset corresponding to a physical page address(PPA) and a logical block address (LBA) associated with the L2P address336-2 occurs based on the first portion of the L2P address 336-2 beingwritten to the first memory block 334-1 and the second portion of theL2P address 336-2 being written to the second memory block 334-2 andwriting an indication comprising at least two bits and corresponding tothe offset to the L2P address 336-2. In some embodiments, the indicationcorresponds to a determination that a new memory block (e.g., the memoryblock 334-2) is being opened to accommodate at least a portion of theL2P address 336-2.

In some embodiments, a first bit and a second bit associated with theindication correspond to a determination that the first portion of theL2P address 336-2 is consecutive with respect to a preceding L2P address(e.g., the L2P address 336-1) written to the first memory block 334-1and the second portion of the L2P address 336-2 is consecutive withrespect to a subsequent L2P address (e.g., the L2P address 336-3)written to the second memory block 334-2. In some embodiments, a firstbit (e.g., the bit 438-30 illustrated in FIG. 4 , herein) and a secondbit (e.g., the bit 438-31 illustrated in FIG. 4 , herein) associatedwith the indication correspond to a determination that data written tothe first memory block 334-1 and the second memory block 334-2 isnon-consecutive.

Continuing with this example, in some embodiments, the processing devicecan perform operations including writing a particular bit sequence to asecond level of the L2P data structure (e.g., the second-level L2P datastructure 232-2 illustrated in FIG. 2 , herein) in response todetermining that the offset does not affect the data written to a firstlevel of the L2P data structure (e.g., the third-level L2P datastructure 232-3 illustrated in FIG. 2 , herein). Embodiments are not solimited, however, and in some embodiments, the processing device canperform operations including writing a particular bit sequence to asecond level of the L2P data structure in response to determining thatthe offset affects the data written to a first level of the L2P datastructure, etc.

FIG. 4 illustrates an example of a logical-to-physical address 436 inaccordance with some embodiments of the present disclosure. The L2Paddress 436 can be analogous to the L2P addresses 336-1, 336-2, and/or336-3 illustrated in FIG. 3 . As shown in FIG. 4 , the L2P address caninclude 32 bits (e.g., the bits 338-0 to 338-31), although embodimentsare not so limited.

In some embodiments, the L2P address 436 can include parity data, suchas a redundant array of independent NAND (RAIN) parity bit(s) inaddition to information corresponding to a physical location in a memorysub-system (e.g., the memory sub-system 110 illustrated in FIG. 1 ,herein) in which data is stored. The L2P address 436 can further includean indication corresponding to an offset that refers to a number ofmemory locations by which non-consecutive PPA information stored withinthe L2P address 436 is physically shifted within a L2P data structure(e.g., the L2P data structure 332 illustrated in FIG. 3 ). In someembodiments, the indication corresponding to the offset information caninclude two bits (e.g., a logical 00, logical 01, logical 10, or logical11) and can be stored in the last two bits (e.g., the bits 438-30 and438-31) of the L2P address 436.

In embodiments in which the offset is not changed for a third-level L2Pdata structure (e.g., the third-level L2P data structure 232-3illustrated in FIG. 2 , herein), the indication bits can be recorded asboth zero, i.e., “00” in bits 438-30 and 438-31 of the L2P address 436in the second-level L2P data structure (e.g., the second-level L2P datastructure 232-2 illustrated in FIG. 2 , herein) if the PPA-LBA≥0. In theevent that the PPA-LBA<0, the indication bits can be recorded as bothone, i.e., “11” in bits 438-30 and 438-31 of the L2P address 436 in thesecond-level L2P data structure.

In contrast, in embodiments in which the offset is altered due toopening a new memory block (e.g., the memory block 334-2 illustrated inFIG. 3 , herein), and the previous L2P address and/or a subsequent L2Paddress are consecutive as described above, the indication bits can berecorded as a one and a zero, i.e., “10” in bits 438-30 and 438-31 ofthe L2P address 436 in the second-level L2P data structure. As describedin connection with Table 1, above, LBAs before the starting LBA can usethe previous offset while LBAs after the starting LBA can use the nextoffset. Finally, the indication bits can be recorded as a zero and aone, i.e., “01” in bits 438-30 and 438-31 of the L2P address 436 in thesecond-level L2P data structure to indicate that the third-level L2Pdata structure contains non-consecutive data.

FIG. 5 is flow diagram corresponding to a method 540 for memory dicearrangement in accordance with some embodiments of the presentdisclosure. The method 540 can be performed by processing logic that caninclude hardware (e.g., processing device, circuitry, dedicated logic,programmable logic, microcode, hardware of a device, integrated circuit,etc.), software (e.g., instructions run or executed on a processingdevice), or a combination thereof. In some embodiments, the method 540is performed by the logical-to-physical mapping component 113 of FIG. 1. Although shown in a particular sequence or order, unless otherwisespecified, the order of the processes can be modified. Thus, theillustrated embodiments should be understood only as examples, and theillustrated processes can be performed in a different order, and someprocesses can be performed in parallel. Additionally, one or moreprocesses can be omitted in various embodiments. Thus, not all processesare required in every embodiment. Other process flows are possible.

At operation 542, whether writing data corresponding to a physical pageaddress (PPA) will result in a change to an offset associated with amedia management operation invoking a first level of a logical tophysical (L2P) data structure (e.g., one of the L2P data structures232-1 to 232-3 illustrated in FIG. 2 , herein) and/or a second level ofthe L2P data structure (e.g., a different one of the L2P data structures232-1 to 232-3 illustrated in FIG. 2 , herein) can be determined. Insome embodiments, the change to the offset corresponds to the data beingwritten across two memory blocks (e.g., the memory blocks 334-1 to 334-Nillustrated in FIG. 3 , herein) of a memory sub-system (e.g., the memorysub-system 110 illustrated in FIG. 1 , herein).

At operation 544, based on the determination, the data corresponding toa physical page address (PPA) to the first level of the L2P datastructure and/or the second level of the L2P data structure can bewritten. In some embodiments, the data can include at least one paritybit, such a RAIN recovery parity bit. The data corresponding to the PPAcan include a thirty-two bit data string and the method 540 can furtherinclude writing the indication corresponding to the offset to athirty-first and a thirty-second location in the thirty-two bit datastring.

At operation 546, responsive to the determination that the writing ofthe data corresponding to the PPA will result in a change to the offsetassociated with the media management operation, an indicationcorresponding to the offset to the first level of the L2P data structureand/or the second level of the L2P data structure can be written. Insome embodiments, the indication can include two bits, and the method540 can further include writing a particular two bit data valuecorresponding to a characteristic of the data corresponding to the PPA,the characteristic indicative of the data corresponding to the PPA beingwritten to the first level of the L2P data structure and/or the secondlevel of the L2P data structure.

The method 540 can further include writing a particular bit sequence tothe second level of the L2P data structure in response to determiningthat the offset does not affect the data written to the first level ofthe L2P data structure and/or writing a particular bit sequence to thesecond level of the L2P data structure in response to determining thatthe offset affects the data written to the first level of the L2P datastructure. Embodiments are not so limited, however, and in someembodiments, the method 540 can include writing a particular bitsequence to the second level of the L2P data structure in response todetermining that the data written to the first level of the L2P datastructure corresponds to a non-consecutive PPA with respect to apreceding L2P address written to the first level of the L2P datastructure or the second level of the L2P data structure, and a secondportion of the data is consecutive with respect to a subsequent L2Paddress written to the first level of the L2P data structure or thesecond level of the L2P data structure. The particular bit sequences canbe determined as described above in connection with FIG. 4 .

FIG. 6 is a block diagram of an example computer system 600 in whichembodiments of the present disclosure may operate. For example, FIG. 6illustrates an example machine of a computer system 600 within which aset of instructions, for causing the machine to perform any one or moreof the methodologies discussed herein, can be executed. In someembodiments, the computer system 600 can correspond to a host system(e.g., the host system 120 of FIG. 1 ) that includes, is coupled to, orutilizes a memory sub-system (e.g., the memory sub-system 110 of FIG. 1) or can be used to perform the operations of a controller (e.g., toexecute an operating system to perform operations corresponding to thelogical-to-physical mapping component 113 of FIG. 1 ). In alternativeembodiments, the machine can be connected (e.g., networked) to othermachines in a LAN, an intranet, an extranet, and/or the Internet. Themachine can operate in the capacity of a server or a client machine inclient-server network environment, as a peer machine in a peer-to-peer(or distributed) network environment, or as a server or a client machinein a cloud computing infrastructure or environment.

The machine can be a personal computer (PC), a tablet PC, a set-top box(STB), a Personal Digital Assistant (PDA), a cellular telephone, a webappliance, a server, a network router, a switch or bridge, or anymachine capable of executing a set of instructions (sequential orotherwise) that specify actions to be taken by that machine. Further,while a single machine is illustrated, the term “machine” shall also betaken to include any collection of machines that individually or jointlyexecute a set (or multiple sets) of instructions to perform any one ormore of the methodologies discussed herein.

The example computer system 600 includes a processing device 602, a mainmemory 604 (e.g., read-only memory (ROM), flash memory, dynamic randomaccess memory (DRAM) such as synchronous DRAM (SDRAM) or Rambus DRAM(RDRAM), etc.), a static memory 606 (e.g., flash memory, static randomaccess memory (SRAM), etc.), and a data storage system 618, whichcommunicate with each other via a bus 630.

The processing device 602 represents one or more general-purposeprocessing devices such as a microprocessor, a central processing unit,or the like. More particularly, the processing device can be a complexinstruction set computing (CISC) microprocessor, reduced instruction setcomputing (RISC) microprocessor, very long instruction word (VLIW)microprocessor, or a processor implementing other instruction sets, orprocessors implementing a combination of instruction sets. Theprocessing device 602 can also be one or more special-purpose processingdevices such as an application specific integrated circuit (ASIC), afield programmable gate array (FPGA), a digital signal processor (DSP),network processor, or the like. The processing device 602 is configuredto execute instructions 626 for performing the operations and stepsdiscussed herein. The computer system 600 can further include a networkinterface device 608 to communicate over the network 620.

The data storage system 618 can include a machine-readable storagemedium 624 (also known as a computer-readable medium) on which is storedone or more sets of instructions 626 or software embodying any one ormore of the methodologies or functions described herein. Theinstructions 626 can also reside, completely or at least partially,within the main memory 604 and/or within the processing device 602during execution thereof by the computer system 600, the main memory 604and the processing device 602 also constituting machine-readable storagemedia. The machine-readable storage medium 624, data storage system 618,and/or main memory 604 can correspond to the memory sub-system 110 ofFIG. 1 .

In one embodiment, the instructions 626 include instructions toimplement functionality corresponding to a logical-to-physical mappingcomponent (e.g., the logical-to-physical mapping component 113 of FIG. 1). While the machine-readable storage medium 624 is shown in an exampleembodiment to be a single medium, the term “machine-readable storagemedium” should be taken to include a single medium or multiple mediathat store the one or more sets of instructions. The term“machine-readable storage medium” shall also be taken to include anymedium that is capable of storing or encoding a set of instructions forexecution by the machine and that cause the machine to perform any oneor more of the methodologies of the present disclosure. The term“machine-readable storage medium” shall accordingly be taken to include,but not be limited to, solid-state memories, optical media, and magneticmedia.

Some portions of the preceding detailed descriptions have been presentedin terms of algorithms and symbolic representations of operations ondata bits within a computer memory. These algorithmic descriptions andrepresentations are the ways used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of operations leading to adesired result. The operations are those requiring physicalmanipulations of physical quantities. Usually, though not necessarily,these quantities take the form of electrical or magnetic signals capableof being stored, combined, compared, and otherwise manipulated. It hasproven convenient at times, principally for reasons of common usage, torefer to these signals as bits, values, elements, symbols, characters,terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. The presentdisclosure can refer to the action and processes of a computer system,or similar electronic computing device, that manipulates and transformsdata represented as physical (electronic) quantities within the computersystem's registers and memories into other data similarly represented asphysical quantities within the computer system memories or registers orother such information storage systems.

The present disclosure also relates to an apparatus for performing theoperations herein. This apparatus can be specially constructed for theintended purposes, or it can include a general purpose computerselectively activated or reconfigured by a computer program stored inthe computer. Such a computer program can be stored in a computerreadable storage medium, such as, but not limited to, any type of diskincluding floppy disks, optical disks, CD-ROMs, and magnetic-opticaldisks, read-only memories (ROMs), random access memories (RAMs), EPROMs,EEPROMs, magnetic or optical cards, or any type of media suitable forstoring electronic instructions, each coupled to a computer system bus.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general purposesystems can be used with programs in accordance with the teachingsherein, or it can prove convenient to construct a more specializedapparatus to perform the method. The structure for a variety of thesesystems will appear as set forth in the description below. In addition,the present disclosure is not described with reference to any particularprogramming language. It will be appreciated that a variety ofprogramming languages can be used to implement the teachings of thedisclosure as described herein.

The present disclosure can be provided as a computer program product, orsoftware, that can include a machine-readable medium having storedthereon instructions, which can be used to program a computer system (orother electronic devices) to perform a process according to the presentdisclosure. A machine-readable medium includes any mechanism for storinginformation in a form readable by a machine (e.g., a computer). In someembodiments, a machine-readable (e.g., computer-readable) mediumincludes a machine (e.g., a computer) readable storage medium such as aread only memory (“ROM”), random access memory (“RAM”), magnetic diskstorage media, optical storage media, flash memory devices, etc.

In the foregoing specification, embodiments of the disclosure have beendescribed with reference to specific example embodiments thereof. Itwill be evident that various modifications can be made thereto withoutdeparting from the broader spirit and scope of embodiments of thedisclosure as set forth in the following claims. The specification anddrawings are, accordingly, to be regarded in an illustrative senserather than a restrictive sense.

What is claimed is:
 1. An apparatus, comprising: a logical to physical(L2P) data structure; and a processing device configured to: determinethat an offset between a physical page address (PPA) and a logical blockaddress (LBA) will be altered in response to writing data correspondingto the PPA and at least one parity bit to the L2P data structure; andcause an indication corresponding to the offset to be written to the L2Pdata structure in response to a determination that the offset will bealtered in response to writing the data and the parity bit to a firstlevel of the L2P data structure or to a second level of the L2P datastructure, or both.
 2. The apparatus of claim 1, wherein the indicationcorresponds to a determination that a first portion of the data isconsecutive with respective to a preceding L2P address written to theL2P data structure.
 3. The apparatus of claim 1, wherein the indicationcorresponds to a determination that a second portion of the data isconsecutive with respect to a subsequent L2P address written to the L2Pdata structure.
 4. The apparatus of claim 1, wherein the indicationcorresponds to a determination that a first level of the L2P datastructure and a second level of the L2P data structure containconsecutively written data.
 5. The apparatus of claim 1, wherein theindication corresponds to a determination that a first level of the L2Pdata structure or a second level of the L2P data structure, or both,contain non-consecutively written data.
 6. The apparatus of claim 1,wherein the indication corresponds to a determination that a firstportion of the data corresponding to the PPA is written to a first levelof the L2P data structure and a second portion of the data correspondingto the PPA is written to the second level of the L2P data structure. 7.The apparatus of claim 1, wherein the processing device is configured toalter the offset in response to a memory block being opened toaccommodate at least a portion of the data corresponding to the PPA. 8.The apparatus of claim 1, wherein a first portion of the datacorresponding to the PPA is written to the first level of the L2P datastructure and a second portion of the data corresponding to the PPA iswritten to the second level of the L2P data structure, and theprocessing device is configured to alter the offset based, at least inpart, on the first portion of the data being written to the first levelof the L2P data structure and the second portion of the data beingwritten to the second level of the L2P data structure.
 9. An apparatus,comprising: a memory device configured to store a logical to physical(L2P) data structure; and a processing device coupled to the memorydevice, wherein the processing device is configured to: determine that afirst portion of a L2P address is to be written to a first memory blockof the memory device and a second portion of the L2P address is to bewritten to a second memory block of the memory device, the L2P addresscomprising at least one parity bit; determine whether an offsetcorresponding to a physical page address (PPA) and a logical blockaddress (LBA) associated with the L2P address occurs based on the firstportion of the L2P address being written to the first memory block andthe second portion of the L2P address being written to the second memoryblock; and write an indication corresponding to the offset to the L2Paddress.
 10. The apparatus of claim 9, wherein the indicationcorresponds to a determination that a third memory block is being openedto accommodate at least a portion of the L2P address.
 11. The apparatusof claim 9, wherein a first bit and a second bit associated with theindication correspond to a determination that the first portion of theL2P address is consecutive with respect to a preceding L2P addresswritten to the first memory block and the second portion of the L2Paddress is consecutive with respect to a subsequent L2P address writtento the second memory block.
 12. The apparatus of claim 9, wherein afirst bit and a second bit associated with the indication correspond toa determination that data written to the first memory block and thesecond memory block is non-consecutive.
 13. The apparatus of claim 9,wherein the processing device is configured to: write a first bitsequence to a second level of the L2P data structure in response to adetermination that the offset does not affect the data written to afirst level of the L2P data structure; and write a second bit sequenceto the second level of the L2P data structure in response to determiningthat the offset affects the data written to the first level of the L2Pdata structure.
 14. A method, comprising: determining that writing datacorresponding to a physical page address (PPA) of a memory device to alogical to physical (L2P) data structure of the memory device results ina change to an offset between the PPA and a corresponding logical blockaddress (LBA) when the data is written across more than one memory blockof the memory device; writing the data and at least one parity bit tothe L2P data structure based on determining that writing the dataresults in the offset; and writing an indication corresponding to theoffset to the L2P data structure.
 15. The method of claim 14, furthercomprising: writing the data corresponding to the PPA to a first levelof the L2P data structure or a second level of the L2P data structure,or both, or writing the indication to the first level of the L2P datastructure or the second level of the L2P data structure, or both. 16.The method of claim 14, further comprising writing a particular bitsequence to a second level of the L2P data structure in response todetermining that the offset does not affect data written to a firstlevel of the L2P data structure.
 17. The method of claim 14, wherein thedata corresponding to the PPA comprises a thirty-two bit data string andwherein the method further comprises writing the indicationcorresponding to the offset to a thirty-first and a thirty-secondlocation in the thirty-two bit data string.
 18. The method of claim 14,wherein the indication comprises two bits, and wherein the methodfurther comprises writing the indication comprising the two bits to theL2P data structure in response to a determination that the datacorresponding to the PPA is written to a first level of the L2P datastructure or a second level of the L2P data structure, or both.
 19. Themethod of claim 14, further comprising writing at least one redundantarray of NAND parity bit as part of writing the at least one parity bitto the L2P data structure.
 20. The method of claim 14, furthercomprising writing a particular bit sequence to the L2P data structurein response to determining that a first portion of the data written tothe L2P data structure corresponds to a non-consecutive PPA with respectto a preceding L2P address written to the L2P data structure, and asecond portion of the data is consecutive with respect to a subsequentL2P address written to the L2P data structure.